منابع مشابه
On Arithmetic Branching Programs
The model of arithmetic branching programs is an algebraic model of computation generalizing the model of modular branching programs. We show that, up to a polynomial factor in size, arithmetic branching programs are equivalent to complements of dependency programs, a model introduced by Pudll ak and Sgall 20]. Using this equivalence we prove that dependency programs are closed under conjunctio...
متن کاملArithmetic Branching Programs with Memory
We extend the well known characterization of VPws as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of branching programs to make them more expressive. We show that allowing different types of memory in branching programs increases the computational power even for const...
متن کاملOn Arithmetic Branching
We consider the model of arithmetic branching programs, which is a generalization of modular branching programs. We show that, up to a polynomial factor in size, arithmetic branching programs are equivalent to complements of dependency programs, a model introduced by Pudl ak and Sgall [14]. Using this equivalence we prove that dependency programs are closed under conjunction, answering an open ...
متن کاملOn the Power of Randomized Branching Programs
We deene the notion of a randomized branching program in the natural way similar to the deenition of a randomized circuit. We exhibit an explicit function f n for which we prove that: 1) f n can be computed by polynomial size randomized read-once ordered branching program with a small one-sided error; 2) f n cannot be computed in polynomial size by deterministic read-once branching programs; 3)...
متن کاملOn uncertainty versus size in branching programs
We propose an information-theoretic approach to proving lower bounds on the size of branching programs. The argument is based on Kraft type inequalities for the average amount of uncertainty about (or entropy of) a given input during the various stages of computation. The uncertainty is measured by the average depth of so-called ‘splitting trees’ for sets of inputs reaching particular nodes of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1648